Simulating polyadic modal logics by monadic ones
نویسندگان
چکیده
We define an interpretation of modal languages with polyadic operators in modal languages that use monadic operators (diamonds) only. We also define a simulation operator which associates a logic Λ in the diamond language with each logic Λ in the language with polyadic modal connectives. We prove that this simulation operator transfers several useful properties of modal logics, such as finite/recursive axiomatizability, frame completeness and the finite model property, canonicity and first-order definability.
منابع مشابه
Expressivity of Coalgebraic Modal Logic: The Limits and Beyond
Modal logic has a good claim to being the logic of choice for describing the reactive behaviour of systems modeled as coalgebras. Logics with modal operators obtained from so-called predicate liftings have been shown to be invariant under behavioral equivalence. Expressivity results stating that, conversely, logically indistinguishable states are behaviorally equivalent depend on the existence ...
متن کاملSahlqvist Formulas in Hybrid Polyadic Modal Logics
Building on a new approach to polyadic modal languages and Sahlqvist formulas introduced in [10] we define Sahlqvist formulas in hybrid polyadic modal languages containing nominals and universal modality or satisfaction operators. Particularly interesting is the case of reversive polyadic languages, closed under all ‘inverses’ of polyadic modalities because the minimal valuations arising in the...
متن کاملExpressive power of monadic logics on words, trees, pictures, and graphs
We give a survey of the expressive power of various monadic logics on specific classes of finite labeled graphs, including words, trees, and pictures. Among the logics we consider, there are monadic secondorder logic and its existential fragment, the modal mu-calculus, and monadic least fixed-point logic. We focus on nesting-depth and quantifier alternation as a complexity measure of these logics.
متن کاملExistential second-order logic and modal logic with quantified accessibility relations
This article investigates the role of arity of second-order quantifiers in existential second-order logic, also known as Σ1. We identify fragments L of Σ1 where second-order quantification of relations of arity k > 1 is (nontrivially) vacuous in the sense that each formula of L can be translated to a formula of (a fragment of) monadic Σ1. Let polyadic Boolean modal logic with identity (PBML) be...
متن کاملAlgebraization of quantifier logics, an introductory overview
This work is an introduction: in particular, to algebras of relations of various ranks, and in general, to the part of algebraic logic algebraizing quantiier logics as well as those propositional logics (like modal logics) in the semantics of which theories of relations play an essential r^ ole. This work has a survey character, too. The most frequently used algebras like cylindric{, relation{,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Symb. Log.
دوره 68 شماره
صفحات -
تاریخ انتشار 2003